Semantic Tableaux with Equality
نویسنده
چکیده
This paper tries to identify the basic problems encountered in handling equality in the semantic tableau framework, and to describe the state of the art in solving these problems. The two main paradigms for handling equality are compared: adding new tableau expansion rules and using E-unification algorithms.
منابع مشابه
Using Mixed Universal and Rigid E-Unification to Handle Equality in Universal Formula Semantic Tableaux
In this paper we describe how a combination of the classical “universal” E-unification and “rigid” Eunification, called “mixed” E-unification, can be used to efficiently handle equality in universal formula semantic tableaux, that are an extension of free variable tableaux.
متن کاملUsing E - Unification to Handle Equality in Universal Formula Semantic Tableaux — Extended
In this paper we describe how a combination of the classical “universal” E-unification and “rigid”E-unification, called “mixed” E-unification, can be used to efficiently handle equality in universal formula semantic tableaux, that are an extension of free variable tableaux.
متن کاملAdding Equality to Semantic Tableaux
This paper tries to identify the basic problems encountered in handling equality in the semantic tableau framework, and to describe the state of the art in solving these problems. The two main paradigms for handling equality are compared: adding new tableau expansion rules and using E-uniication algorithms; their eecient implementation is discussed.
متن کاملAn Improved Method for Adding Equality to Free Variable Semantic Tableaux
Tableau–Based theorem provers can be extended to cover many of the nonclassical logics currently used in AI research. For both, classical and nonclassical first–order logic, equality is a crucial feature to increase expressivity of the object language. Unfortunately, all so far existing attempts of adding equality to semantic tableaux have been more or less experimental and turn out to be usele...
متن کاملA Completion–Based Method for Adding Equality to Free Variable Semantic Tableaux
For both classical and nonclassical first–order logic equality is a crucial feature to increase expressivity of the object language. It is, therefore, of great importance to have a method at hand that allows tableau–based theorem provers to handle equality in an efficient way. In the first approaches to adding equality to semantic tableaux [8, 10, 11] additional tableau rules were defined that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997